A Concrete Representation of Observational Equivalence for PCF
نویسندگان
چکیده
A result on observational equivalence for PCF and innocent strategies, as presented at the Games for Logic and Programming Languages (GaLoP) workshop in York, March 2009. The full abstraction result for PCF using game semantics requires one to identify all innocent strategies that are innocently indistinguishable. This involves a quantification over all innocent tests, cf. quantification over all innocent contexts. Here we present a representation of innocent strategies that equates innocently indistinguishable ones, yielding a representation of PCF terms that equates precisely those terms that are observational equivalent.
منابع مشابه
Full abstraction for a Linear PCF
We study S PCF , namely a Turing-complete programming language inspired by a semantic notion of linearity. S PCF is based on a linear core of PCF and some operators providing basic primitives related to exception handling and nondeterministic evaluation. We show that S PCF is fully abstract for a linear model in the category of coherence spaces and linear functions, giving a cogent evidence of ...
متن کاملFull Abstraction for PCF
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain “history-free” strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable in a certain simple extension of PCF. We then introduce an intrinsic preorder on strategies, and show that i...
متن کاملObservable Sequentiality and Full Abstraction 1 Full Abstraction and Sequentiality
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting th...
متن کاملLogical Relations for PCF
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the Y combinator coincides with the domaintheoretic fixpoint operator, that parallel-or and the Plotkin existential are not definable in PCF, that the continuation semantics for PCF coincides with the direct semantics, and that our domain-theoretic semantics for PCF is a...
متن کاملFrom Mathematical Functions to Syntax
@article{gdp:lcf-as-pl, author={Plotkin, G. D.}, title={LCF Considered as a Programming Language}, journal={Theoretical Computer Science}, pages={223--255}, year=1977 } Summary: Plotkin investigates the relation between the denotational and the operational semantics of a programming language. As a working example, he picks PCF a language based on Scott’s Logic of Computable Functions. He demons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1003.0107 شماره
صفحات -
تاریخ انتشار 2009